A finitely presented monoid which has solvable word problem but has no regular complete presentation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Finitely presented group whose word problem has sampleable hard instances

Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More precisely the problem has a complexity core sampleable in linear time.

متن کامل

A Solvable Conjugacy Problem for Finitely Presented C(3) Semigroups

In his thesis, Remmers [R], introduced semigroup derivation diagrams and used them to prove that the word problem for finitely presented C(3) semigroups was solvable. In this article we introduce the annular analog of semigroup derivation diagrams and use them to demonstrate the solution to a conjugacy problem for finitely presented C(3) semigroups. Version of 5-21-2013

متن کامل

Subgroups of Finitely Presented Groups with Solvable Conjugacy Problem

We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.

متن کامل

A Variety with Solvable, but Not Uniformly Solvable, Word Problem

In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if there is an algorithm which given a finite presentation produces an algorithm for solving the word problem of the algebra so presented. A variety is given with f...

متن کامل

A simple non-bisimple congruence-free finitely presented monoid

We exhibit an example of a finitely presented monoid that is congruence-free and simple but not bisimple.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1995

ISSN: 0304-3975

DOI: 10.1016/0304-3975(94)00264-j